High-level Data Access Based on Query Rewritings
نویسنده
چکیده
This paper describes the ODBA problem solution based on query rewriting techniques, introduces the DL-Lite logics for knowledge representation and the query rewriting algorithms for high-level data access. The RQR algorithm’s optimization capabilities are considered. KeywordsODBA;description logic; DL-Lite; query answering, query rewriting,OWL 2 QL
منابع مشابه
The price of query rewriting in ontology-based data access
We give a solution to the succinctness problem for the size of first-order rewritings of conjunctive queries in ontologybased data access with ontology languages such as OWL 2 QL , linear Datalog± and sticky Datalog±. We show that positive existential and nonrecursive datalog rewritings, which do not use extra non-logical symbols (except for intensional predicates in the case of datalog rewriti...
متن کاملTowards Temporal Fuzzy Query Answering on Stream-based Data
For reasoning over streams of data ontology-based data access is a common approach. The method for answering conjunctive queries (CQs) over DL-Lite ontologies in this setting is by rewritings of the query and evaluation of the resulting query by a data base engine. For streambased applications the classical expressivity of DL-Lite lacks means to handle fuzzy and temporal information. In this pa...
متن کاملLong Rewritings, Short Rewritings
An ontology language L is said to enjoy FO-rewritability if any conjunctive query (CQ) q over any ontology T , given in L, can be transformed into an FOformula q′ such that, for any data A, all answers to q over the knowledge base (T ,A) can be found by querying q′ over A using a standard relational database management system (RDBMS). Ontology languages with this property include the OWL2QL pro...
متن کاملAlgebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query op timization data integration data warehousing etc Query rewriting in relational databases is by now rather well investigated However in the framework of semistructured data the problem of rewriting has received much less attention In this paper we focus on extracting as much information as possible from algeb...
متن کاملOntology evolution without tears
The evolution of ontologies is an undisputed necessity in ontology-based data integration. Yet, few research efforts have focused on addressing the need to reflect the evolution of ontologies used as global schemata onto the underlying data integration systems. In most of these approaches, when ontologies change their relations with the data sources, i.e., the mappings, are recreated manually, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011